Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
f(s(a),s(b),x) |
→ f(x,x,x) |
| 2: |
|
g(f(s(x),s(y),z)) |
→ g(f(x,y,z)) |
| 3: |
|
cons(x,y) |
→ x |
| 4: |
|
cons(x,y) |
→ y |
|
There are 3 dependency pairs:
|
| 5: |
|
F(s(a),s(b),x) |
→ F(x,x,x) |
| 6: |
|
G(f(s(x),s(y),z)) |
→ G(f(x,y,z)) |
| 7: |
|
G(f(s(x),s(y),z)) |
→ F(x,y,z) |
|
The approximated dependency graph contains 2 SCCs:
{5}
and {6}.
-
Consider the SCC {5}.
There are no usable rules.
The constraints could not be solved.
-
Consider the SCC {6}.
The usable rules are {1}.
The constraints could not be solved.
Tyrolean Termination Tool (0.01 seconds)
--- May 4, 2006